Almost Time-Independent Performance in Time-Modulated Linear Arrays

Pattern Synthesis in Time-modulated Linear Arrays through Pulse Shifting

In this paper, an innovative approach for the synthesis of time-modulated linear array antennas is presented. The switch-on instants of the time-modulated elements are taken into account as additional degrees of freedom to optimize the array pattern. Towards this end, a technique based on a Particle Swarm Optimization is proposed to fully exploit the dependence of the sideband radiations on the...

Adaptivenulling in Time-modulated Linear Arrays Withminimum Power Losses

The synthesis of adaptive time-modulated linear arrays is dealt with by means of an innovative strategy, in which a Particle Swarm Optimizer is used to reconfigure the pulse sequence controlling the static element excitations, as well as the least significant bits of digital phase shifters to maximize the signal-to-interference-plus-noise ratio at the receiver. The reduction of the power conten...

Acoustical Direction Finding with Time-Modulated Arrays

Time-Modulated Linear Arrays (TMLAs) offer useful efficiency savings over conventional phased arrays when applied in parameter estimation applications. The present paper considers the application of TMLAs to acoustic systems and proposes an algorithm for efficiently deriving the arrival angle of a signal. The proposed technique is applied in the frequency domain, where the signal and harmonic c...

Building PQR trees in almost-linear time

In 1976, Booth and Leuker invented the PQ trees as a compact way of storing and manipulating all the permutations on n elements that keep consecutive the elements in certain given sets C1, C2, . . . , Cm. Such permutations are called valid. This problem finds applications in DNA physical mapping, interval graph recognition, logic circuit optimization and data retrieval, among others. PQ trees c...

Symbolic Program Analysis in Almost-Linear Time